翻訳と辞書 Words near each other ・ Minimoni Kazoe Uta (Ofuro Version) / Minimoni Kazoe Uta (Date Version) ・ Minimoni Song Daihyakka Ikkan ・ Minimoni Songs 2 ・ Minimoni Telephone! Rin Rin Rin / Minimoni Bus Guide ・ MiniMonos ・ Minimoog ・ Minimoog Voyager ・ MINIMOP ・ Minimotif Miner ・ Minimum (disambiguation) ・ Minimum acceptable rate of return ・ Minimum Age Convention, 1973 ・ Minimum alveolar concentration ・ Minimum audibility curve ・ Minimum bactericidal concentration ・ Minimum bottleneck spanning tree ・ Minimum bounding box ・ Minimum bounding box algorithms ・ Minimum bounding circle ・ Minimum bounding rectangle ・ Minimum capital ・ Minimum capital requirement ・ Minimum chi-square estimation ・ Minimum Chips ・ Minimum contacts ・ Minimum control speeds ・ Minimum crossing altitude ・ Minimum cut ・ Minimum daily balance ・ Minimum Data Set Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Minimum bottleneck spanning tree ： ウィキペディア英語版 Minimum bottleneck spanning tree In mathematics, a minimum bottleneck spanning tree (MBST) in an undirected graph is a spanning tree in which the most expensive edge is as cheap as possible. A bottleneck edge is the highest weighted edge in a spanning tree. A spanning tree is a minimum bottleneck spanning tree if the graph does not contain a spanning tree with a smaller bottleneck edge weight.〔(Everything about Bottleneck Spanning Tree )〕 For a directed graph, a similar problem is known as Minimum Bottleneck Spanning Arborescence (MBSA). == Definitions == 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Minimum bottleneck spanning tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.